Goodstein sequences for prominent ordinals up to the ordinal of Π11-CA0
نویسندگان
چکیده
We introduce strong Goodstein principles which are true but unprovable in strong impredicative theories like IDn.
منابع مشابه
Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
This paper is intended to give for a general mathematical audience (including non logicians) a survey about intriguing connections between analytic combinatorics and logic. We define the ordinals below ε0 in non-logical terms and we survey a selection of recent results about the analytic combinatorics of these ordinals. Using a versatile and flexible (logarithmic) compression technique we give ...
متن کاملGoodstein’s theorem revisited
Inspired by Gentzen’s 1936 consistency proof, Goodstein found a close fit between descending sequences of ordinals < ε0 and sequences of integers, now known as Goodstein sequences. This article revisits Goodstein’s 1944 paper. In light of new historical details found in a correspondence between Bernays and Goodstein, we address the question of how close Goodstein came to proving an independence...
متن کاملComputing Bounds from Arithmetical Proofs
We explore the role of the function a + 2, and its generalizations to higher number classes, in providing complexity bounds for the provably computable functions across a broad spectrum of theories, based on a “predicative” induction scheme and ranging in strength between polynomial-time arithmetic and Π11-CA0. The resulting “fast-growing” sub-recursive hierarchy forges a direct link between pr...
متن کاملSemantics and Syntax for Ordinal Notations and Hierarchies
We give a complete description of a class of free innnitary algebras in the category of posets. They are represented as functors to the ordinal. One of these algebras is used to deene an ordinal notation system based on the simply typed lambda calculus, and prove its soundness. As an application the Slow Growing and Hardy hierarchies are described in that calculus. The literature on ordinal not...
متن کاملA New System of Proof-theoretic
In this paper we present a family of ordinal functions % (v ~< to), which seems to provide the so far simplest method for denoting large constructive ordinals. These functions are a simplified version of the 0-functions, but nevertheless have the same strength as those. This will be shown at the end of the paper (Theorem 3.7) by using proof-theoretic results from [1], [2], [5]. In Section 1 we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 164 شماره
صفحات -
تاریخ انتشار 2013